Two Efficient Approximate Unsigned Multipliers by Developing New Configuration for Approximate 4:2 Compressors

نویسندگان

چکیده

Approximate computing is a promising approach for reducing power consumption and design complexity in applications that accuracy not crucial factor. multipliers are commonly used error-tolerant applications. This paper presents three approximate 4:2 compressors two multiplier designs, aiming at the area consumption, while maintaining acceptable accuracy. The seeks to develop align positive negative approximations input patterns have same probability. Additionally, proposed utilized construct different columns of partial products based on probabilities adjacent columns. synthesized using 28nm technology. Compared exact multiplier, first improves $\times $ delay by 91% 86%, respectively, second parameters 90% 84%, respectively. performance methods was assessed compared with existing image multiplication, sharpening, smoothing edge detection. Also, hardware implementation neural network investigated, simulation results indicate appropriate these

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparative Study of Approximate Multipliers

Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area and power, makes the identification of the most suitable approximate multiplier quite challenging. In this paper, we identify three major decision making fac...

متن کامل

Approximate multipliers and approximate double centralizers: A fixed point approach

In the present paper, the Hyers-Ulam stability and also the superstability of double centralizers and multipliers on Banach algebras are established by using a fixed point method. With this method, the condition of without order on Banach algebras is no longer necessary.

متن کامل

Approximate convolution using DCT coefficient multipliers

DCT-domain processing, filtering, convolution, image enhancement, quantization tables We develop a method for designing DCT coefficient multipliers in order to approximate the operation of 2D convolution of an image with a given kernel. The method is easy to implement on compressed formats of DCT-based compression methods (JPEG, MPEG, H.261) by applying decoding quantization tables that are inc...

متن کامل

Efficient Algorithms for Approximate Reasoning

We present algorithms for approximate reasoning computations, for some intersection and implication functions, which are as efficient as Mamdani’s interpolation method. Implementations of the algorithms are given in the functional language Mi r a n d a.

متن کامل

Efficient Approximate Dictionary Matching

Named entity recognition (NER) systems are important for extracting useful information from unstructured data sources. It is known that large domain dictionaries help in improving extraction performance of NER. Unstructured text usually contains entity mentions that are different from their standard dictionary form. Approximate matching is important to identify the correct dictionary entity for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems I-regular Papers

سال: 2023

ISSN: ['1549-8328', '1558-0806']

DOI: https://doi.org/10.1109/tcsi.2023.3242558